A Multi-Objective Tri-Level Algorithm for Hub-and-Spoke Network in Short Sea Shipping Transportation
نویسندگان
چکیده
Hub-and-Spoke (H&S) network modeling is a form of transport topology optimization in which joins are connected through intermediate hub nodes. The Short Sea Shipping (SSS) problem aims to efficiently disperse passenger flows involving multiple vessel routes and intermediary hubs passengers transferred their final destination. contains elements the Travelling Salesman, with different levels among islands, making it more demanding than typical H&S one, as selection within nodes shortest islands internal goals. This work introduces multi-objective tri-level algorithm for General Network (GNSSS) reduce travel distances transportation costs while improving quality user satisfaction, mainly by minimizing hours spent on board. analysis performed at three decisions: (a) node assignment, (b) island-to-line (c) island service sequence each line. Due magnitude complexity problem, genetic employed implementation. performance has been tested evaluated several real simulated case studies sizes operational scenarios. results indicate that provides rational solutions accordance desired sub-objectives. consideration leads quite scattered solution space, indicating necessity employing formal methods. Typical Pareto diagrams present non-dominated varying range 30 percent terms total distance traveled 50 relation cumulative hours. Evaluation further satisfactory result stability (repeatability) computational time requirements. In conclusion, tool assisting operation planning decisions shipping companies directions cost reduction traveler upgrade. addition, model can be adapted other applications supply chain.
منابع مشابه
A Multi-Level Capacity Approach to the Hub and Spoke Network
The existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. Although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...
متن کاملReliable hub-and-spoke network design problems under uncertainty through multi-objective programming
HLP (hub location problem) tries to find locations of hub facilities and assignment of nodes to extended facilities. Hubs are facilities to collect, arrange, and distribute commodities in telecommunication networks, cargo delivery systems, etc. Hubs are very crucial and their inaccessibility impresses on network whole levels. In this paper, first, total reliability of the network is defined bas...
متن کاملa multi-level capacity approach to the hub and spoke network
the existing works considering the flow-based discount factor in the hub and spoke problems, assume that increasing the amount of flow passing through each edge of network continuously decreases the unit flow transportation cost. although a higher volume of flow allows for using wider links and consequently cheaper transportation, but the unit of flow enjoys more discounts, quite like replacing...
متن کاملDesigning Hub and Spoke Transportation Systems for a Competitive Environment
In this paper, we consider the design of large-scale hub-and-spoke transportation networks in a competitive environment. We adopt the hub arc location model that locates arcs with discounted transport costs connecting pairs of hub facilities. Two firms compete for passengers in a Stackelberg framework where the leader firm locates hub arcs to maximize its revenue, given that the follower firm w...
متن کاملA passenger demand model for air transportation in a hub-and-spoke network
This paper develops an air passenger model that deals with city-pair demand generation and demand assignment in a single framework. Using publicly available and regularly collected panel data, the model captures both time series and cross-sectional variation of air travel demand. The empirical analysis finds that pattern of correlations among alternatives can be described by a three-level neste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2023
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a16080379